CYCLIC CODES AND THEIR DUALS OVER Zm

نویسنده

  • TAHER ABUALRUB
چکیده

In this paper we study the cyclic codes over Zm as being Zm-submodules of ZmG and we find their minimal generating sets. We also study the dual codes of cyclic codes and find their generators as being ideals in ZmG. Throughout this paper, we assume m = q, q is a prime number and (n, q) = 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Class of Reducible Cyclic Codes and Their Weight Distribution

In this paper, a family of reducible cyclic codes over Fp whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.

متن کامل

A class of five-weight cyclic codes and their weight distribution

In this paper, a family of five-weight cyclic codes over Fp whose duals have three zeros is presented, where p is an odd prime. And the weight distribution of these cyclic codes is determined.

متن کامل

A class of six-weight cyclic codes and their weight distribution

In this paper, a family of six-weight cyclic codes over Fp whose duals have three zeros is presented, where p is an odd prime. And the weight distribution of these cyclic codes is determined.

متن کامل

Bounds on the minimum distance of the duals of BCH codes

We consider primitive cyclic codes of length p − 1 over Fp. The codes of interest here are duals of BCH codes. For these codes, a lower bound on their minimum distance can be found via the adaptation of the Weil bound to cyclic codes (see [10]). However, this bound is of no significance for roughly half of these codes. We shall fill this gap by giving, in the first part of the paper, a lower bo...

متن کامل

A class of optimal ternary cyclic codes and their duals

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let m = 2l+1 for an integer l≥ 1 and π be a generator of GF(3m)∗. In this paper, a class of cyclic codes C(u,v) over GF(3) with two nonzeros πu and πv is studied, where u = (3m +1)/2, and v = 2 ·3l+ 1 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999